Papers with routing methods
SEMIROUTER: Sparse-Data Enhanced Routing for Adaptive Multi-LLM System (2026.eacl-long)
Copied to clipboard
| Challenge: | Existing routing methods suffer from poor scalability and dependence on datasets for training . energy footprint is also considered in the decision to implement our new LLM routing framework . |
| Approach: | They propose a new LLM routing framework that dynamically allocates queries to the most appropriate LLM. |
| Outcome: | The proposed method improves data efficiency, adaptability, and routing accuracy compared to existing methods. |
HyperRouter: Towards Efficient Training and Inference of Sparse Mixture of Experts (2023.emnlp-main)
Copied to clipboard
Truong Do, Le Khiem, Quang Pham, TrungTin Nguyen, Thanh-Nam Doan, Binh Nguyen, Chenghao Liu, Savitha Ramasamy, Xiaoli Li, Steven Hoi
| Challenge: | Recent studies suggest that fixing the routers can achieve competitive performance by alleviating the collapsing problem, where all experts eventually learn similar representations. |
| Approach: | They propose a method that dynamically generates router parameters through a fixed hypernetwork and trainable embeddings to achieve a balance between training the routers and freezing them to learn an improved routing policy. |
| Outcome: | Experiments on a wide range of tasks show that the proposed method performs better than existing methods. |
RadialRouter: Structured Representation for Efficient and Robust Large Language Models Routing (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Current routing methods are limited in exploring the connection between query and LLM characteristics. |
| Approach: | They propose a framework for LLM routing that uses a transformer-based backbone and a radial structure to articulate the query-LLMs relationship. |
| Outcome: | The proposed framework outperforms existing routing methods by 9.2% and 5.8% on RouterBench. |
ATLAS: Orchestrating Heterogeneous Models and Tools for Multi-Domain Complex Reasoning (2026.findings-acl)
Copied to clipboard
Jinyang Wu, Guocheng Zhai, Ruihan Jin, Jiahao Yuan, Yuhao Shen, Shuai Zhang, Zhengqi Wen, Jianhua Tao
| Challenge: | Existing approaches to optimize large language models with external tools are limited. |
| Approach: | They propose a dual-path framework for dynamic tool usage in cross-domain complex reasoning . they exploit empirical priors for domain-specific alignment and RL-based multi-step routing . |
| Outcome: | The proposed framework outperforms closed-source models and existing methods on in-distribution and out-of-distortion tasks. |
Beyond Query Memorization: Large Language Model Routing with Query Decomposition and Historical Matching (2026.acl-long)
Copied to clipboard
Bo Lv, Jingbo Sun, Jianwei Lv, Chen Tang, Shaojie Zhang, Nayu Liu, Guoxin Yu, Zihao Li, Qichao Zhang, Dongbin Zhao, Ping Luo, Yue Yu
| Challenge: | Existing routing methods rely on direct mapping from queries to models based on surface-level features, leading to poor generalizability on out-of-distribution data. |
| Approach: | They propose a new routing framework that recasts the routing task as a matching process of sifting similar queries from historical logs. |
| Outcome: | The proposed framework improves matching accuracy while lowering inference costs . it decouples linguistic surface forms from task-intrinsic requirements . |
LLMRouterBench: A Massive Benchmark and Unified Framework for LLM Routing (2026.findings-acl)
Copied to clipboard
Hao Li, Yiqun Zhang, Zhaoyan Guo, Chenxu Wang, Shengji Tang, Qiaosheng Zhang, Yang Chen, Biqing Qi, Peng Ye, Lei Bai, Zhen Wang, Shuyue Hu
| Challenge: | Large language model (LLM) routing assigns each query to the best suitable model from an ensemble. |
| Approach: | They introduce a large-scale benchmark and unified framework for LLM routing . they find that many routing methods exhibit similar performance under unified evaluation . |
| Outcome: | The proposed benchmark provides comprehensive metrics for both performance-oriented and performance-cost trade-off routing. |